\documentclass[conference]{IEEEtran}
\usepackage{graphicx}
\usepackage{hyperref}

\hypersetup{
    bookmarks=true,         % show bookmarks bar?
    unicode=false,          % non-Latin characters in Acrobat?s bookmarks
    pdftoolbar=true,        % show toolbar?
    pdfmenubar=true,        % show menu?
    pdffitwindow=true,      % window fit to page when opened
    pdfstartview={FitH},    % fits the width of the page to the window
    pdftitle={Two Algorithms for Sorting on Heterogeneous Clusters},
    pdfauthor={Anonymous},       % author
    pdfsubject={Sorting},   % subject of the document
    pdfcreator={PDFLatex},      % creator of the document
    pdfproducer={PDFLatex},     % producer of the document
    pdfkeywords={Sorting} {GPU}, % list of keywords
    pdfnewwindow=true,      % links in new window
    colorlinks=true,        % false: boxed links; true: colored links
    linkcolor=red,          % color of internal links
    citecolor=green,        % color of links to bibliography
    filecolor=magenta,      % color of file links
    urlcolor=cyan           % color of external links
}

\usepackage{flushend}
\usepackage{multirow}
\begin{document}

\title{Two Algorithms for Sorting On Heterogeneous Clusters}

\author{\IEEEauthorblockN{Kyle Spafford, Jeremy Meredith, Jeffrey Vetter\,\,\,\,\,\,}
\IEEEauthorblockA{Future Technologies Group\\
Oak Ridge National Laboratory\\
\href{mailto:spaffordkl@ornl.gov}{spaffordkl},
\href{mailto:jsmeredith@ornl.gov}{jsmeredith},
\href{mailto:vetter@ornl.gov}{vetter}
%spaffordkl, jsmeredith, vetter @ ornl.gov}
 @ ornl.gov}
\and
\IEEEauthorblockN{Aparna Chandramowlishwaran, David Noble, Richard Vuduc}
\IEEEauthorblockA{College of Computing\\
Georgia Institute of Technology\\
\href{mailto:aparna@gatech.edu}{aparna},
\href{mailto:david.noble.jr@gatech.edu}{david.noble.jr},
\href{mailto:richie@gatech.edu}{richie}
%aparna, david.noble.jr, richie @ gatech.edu}
 @ gatech.edu}
}
% make the title area
\maketitle

\begin{abstract}
In the past few years, performance improvements in CPUs and memory technologies
have outpaced those of storage systems.
%
When extrapolated to the exascale, this trend places strict limits on the amount
of data that can be written to disk for full analysis, resulting in an increased
reliance on characterizing in-memory data.
%
Many of these characterizations are simple, but require sorted data. 
%
This paper explores variations on two classic algorithms for distributed 
sorting\,---\,radix and sample sort\,---\,under two novel constraints imposed by 
the projected requirements of an exascale machine, heterogeneity and 
limited external storage. 
%
The two approaches are evaluated on the GPU-based NSF Keeneland system,
including an analysis of data movement and the effects of GPUs on 
performance and scalability.
%
Results from Keeneland indicate a substantial performance advantage 
for sample-based approaches on some data distributions, but this
advantage comes at the cost of randomized behavior and load imbalance.
%

\end{abstract}

\input{01-narrative/1-intro.tex}

% note: moved this earlier
\input{01-narrative/6-related.tex}

\input{01-narrative/2-approach.tex}
\input{01-narrative/3-eval.tex}
\input{01-narrative/4-results.tex}
\input{01-narrative/5-analysis.tex}

%\input{01-narrative/7-conclusion.tex}

%\section{Acknowledgments}
%This research is sponsored in part by the Office of Advanced Computing
%Research, U.S. Department of Energy, the National Science Foundation
%award OCI-0910735 and DARPA contract HR0011-10-9-0008.
%
%The work was performed at Oak Ridge National Laboratory, which is 
%managed by UT-Battelle, LLC under Contract No. DE-AC05-00OR22725.
%
%The views and conclusions contained in this document are those of the
%authors and should not be interpreted as representing the official
%policies, either expressed or implied, of the U.S. Government.

\bibliographystyle{abbrv}
\bibliography{02-biblio/sorting}

\end{document}


